Decreasing Weighted Sorted $\ell_1$ Regularization
نویسندگان
چکیده
We consider a new family of regularizers, termed weighted sorted `1 norms (WSL1), which generalizes the recently introduced octagonal shrinkage and clustering algorithm for regression (OSCAR) and also contains the `1 and `∞ norms as particular instances. We focus on a special case of the WSL1, the decreasing WSL1 (DWSL1), where the elements of the argument vector are sorted in non-increasing order and the weights are also non-increasing. In this paper, after showing that the DWSL1 is indeed a norm, we derive two key tools for its use as a regularizer: the dual norm and the Moreau proximity operator.
منابع مشابه
An $\mathcal{O}(n\log n)$ projection operator for weighted $\ell_1$-norm regularization with sum constraint
We provide a simple and efficient algorithm for the projection operator for weighted l1-norm regularization subject to a sum constraint, together with an elementary proof. The implementation of the proposed algorithm can be downloaded from the author’s homepage. 1 The problem In this report, we consider the following optimization problem: min x 1 2 ‖x− y‖ 2 + n
متن کاملThe Ordered Weighted $\ell_1$ Norm: Atomic Formulation, Projections, and Algorithms
The ordered weighted `1 norm (OWL) was recently proposed, with two different motivations: because of its good statistical properties as a sparsity promoting regularizer, and as generalization of the so-called octagonal shrinkage and clustering algorithm for regression (OSCAR). The OSCAR is a convex groupsparsity inducing regularizer, which does not require the prior specification of the group s...
متن کامل$L_1/\ell_1$-to-$L_1/\ell_1$ analysis of linear positive impulsive systems with application to the $L_1/\ell_1$-to-$L_1/\ell_1$ interval observation of linear impulsive and switched systems
Sufficient conditions characterizing the asymptotic stability and the hybrid L1/`1-gain of linear positive impulsive systems under minimum and range dwell-time constraints are obtained. These conditions are stated as infinite-dimensional linear programming problems that can be solved using sum of squares programming, a relaxation that is known to be asymptotically exact in the present case. The...
متن کاملA Noise-Robust Method with Smoothed \ell_1/\ell_2 Regularization for Sparse Moving-Source Mapping
The method described here performs blind deconvolution of the beamforming output in the frequency domain. To provide accurate blind deconvolution, sparsity priors are introduced with a smooth l1/l2 regularization term. As the mean of the noise in the power spectrum domain is dependent on its variance in the time domain, the proposed method includes a variance estimation step, which allows more ...
متن کاملWeighted-{$\ell_1$} minimization with multiple weighting sets
In this paper, we study the support recovery conditions of weighted `1 minimization for signal reconstruction from compressed sensing measurements when multiple support estimate sets with different accuracy are available. We identify a class of signals for which the recovered vector from `1 minimization provides an accurate support estimate. We then derive stability and robustness guarantees fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014